Stochastic Decoding of Turbo Codes

Decoding of Block Turbo Codes

Turbo-decoding of Nonbinary Codes

Turbo-decoding of nonbinary codes Jens Berkmann and Frank Burkert Dept. of Communications Engineering, Technical University of Munich Arcisstr. 21, 80290 Munich, Germany Email [email protected] Abstract | It is shown how parallel concatenation of nonbinary codes can be put into the same framework of iterative decoding as in the binary case. The turbocode(turbo-decoding-) idea is...

List decoding of turbo codes

List decoding of turbo codes is analyzed under the assumption of a maximum-likelihood (ML) list decoder. It is shown that large asymptotic gains can be achieved on both the additive white Gaussian noise (AWGN) and fully interleaved flat Rayleigh-fading channels. It is also shown that the relative asymptotic gains for turbo codes are larger than those for convolutional codes. Finally, a practica...

Collaborative Decoding Using Turbo Codes

Cooperative reception allows diversity to be achieved by a group of radios that are not physically connected but that receive independent copies of a message. The receivers achieve diversity by exchanging messages. One such technique is collaborative decoding, in which the receivers iterate between decoding and information exchange. Collaborative decoding has been shown to be effective for conv...

Maximum a Posteriori Decoding of Turbo Codes

The process of turbo-code decoding starts with the formation of a posteriori probabilities (APPs) for each data bit, which is followed by choosing the data-bit value that corresponds to the maximum a posteriori (MAP) probability for that data bit. Upon reception of a corrupted code-bit sequence, the process of decisionmaking with APPs allows the MAP algorithm to determine the most likely inform...